Degree sums and subpancyclicity in line graphs
نویسندگان
چکیده
منابع مشابه
Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path
A graph is called subpancyclic if it contains a cycle of length l for each l between 3 and the circumference of a graph. We show that if G is a connected graph on n ≥ 146 vertices such that d(u)+d(v)+d(x)+d(y) > n+10 2 for all four u, v, x, y of a path P = uvxy in G, then its line graph is subpancyclic unless G is isomorphic to an exceptional graph, and the result is best possible, even under t...
متن کاملLong cycles in graphs with large degree sums
A number of results are established concerning long cycles in graphs with large degree sums. Let G be a graph on n vertices such that d(x) + d(y) + d(z) 3s for all triples of independent vertices x, y, z. Let c be the length of a longest cycle in G and (Y the cardinality of a maximum independent set of vertices. If G is l-tough and s an, then every longest cycle in G is a dominating cycle and c...
متن کاملCritical graphs for subpancyclicity of 3-connected claw-free graphs
Let Fk be the family of graphs G such that all sufficiently large k-connected claw-free graphs which contain no induced copies of G are subpancyclic. We show that for every k≥3 the family F1k is infinite and make the first step toward the complete characterization of the family F3. 2009 Wiley Periodicals, Inc. J Graph Theory 62: 263–278, 2009 Contract grant sponsor: KBN (T. L.); Contract grant ...
متن کاملCircumferences of 3-connected tough graphs with large degree sums
Let G be a 3-connected tough graph of order n with circumference c(G), independence number a(G) and vertex connectivity K(G) , such that d(x)+d(y)+ d(z)+d(w):2:s for any independent set { x, y, z, w} of vertices. In [7] we have proved: when s:2:n+c(G)/2, every longest cycle ofG is a dominating cycle and c(G) :2:min{n, n+s/4-a(G) }. This paper improves the results by showing that under the same ...
متن کاملDegree distribution and assortativity in line graphs of complex networks
Topological characteristics of links of complex networks influence the dynamical processes executed on networks triggered by links, such as cascading failures triggered by links in power grids and epidemic spread due to link infection. The line graph transforms links in the original graph into nodes. In this paper, we investigate how graph metrics in the original graph are mapped into those for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00468-4